Solvable graphs and Fermat primes
نویسندگان
چکیده
منابع مشابه
Fermat Numbers and Elite Primes
Fn+1 = (Fn − 1) + 1, n ≥ 0 and are pairwise coprime. It is conjectured that Fn are always square-free and that, beyond F4, they are never prime. The latter would imply that there are exactly 31 regular polygons with an odd number Gm of sides that can be constructed by straightedge and compass [2]. The values G1, G2, . . ., G31 encompass all divisors of 232−1 except unity [3]. Let G0 = 1. If we ...
متن کاملLarge primes and Fermat factors
A systematic search for large primes has yielded the largest Fermat factors known.
متن کاملDesigning Solvable Graphs for Multiple Moving Agents
Solvable Graphs (also known as Reachable Graphs) are types of graphs that any arrangement of a specified number of agents located on the graph’s vertices can be reached from any initial arrangement through agents’ moves along the graph’s edges, while avoiding deadlocks (interceptions). In this paper, the properties of Solvable Graphs are investigated, and a new concept in multi agent moti...
متن کاملBounds of Multiplicative Character Sums with Fermat Quotients of Primes
Given a prime p, the Fermat quotient qp(u) of u with gcd(u, p)= 1 is defined by the conditions qp(u)≡ u p−1 − 1 p mod p, 0≤ qp(u)≤ p − 1. We derive a new bound on multiplicative character sums with Fermat quotients qp(`) at prime arguments `. 2010 Mathematics subject classification: primary 11A07; secondary 11L40, 11N25.
متن کاملNon-vanishing of Carlitz-fermat Quotients modulo Primes
Contents 1. Introduction 1 2. Carlitz-Fermat quotients 2 3. Non-vanishing of Carlitz-Fermat quotients modulo primes 4 1. Introduction. Let q = p s , where p is a prime and s is a positive integer. Let F q be the finite field of q elements, and set A = F q [T ] and k = F q (T). Let τ be the mapping defined by τ (x) = x q , and let kτ denote the twisted polynomial ring. Let C : A → kτ (a → C a) b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Hokkaido Mathematical Journal
سال: 2010
ISSN: 0385-4035
DOI: 10.14492/hokmj/1277385661